Gray codes with bounded weights
نویسندگان
چکیده
Given a set H of binary vectors of length n, is there a cyclic listing of H so that every two successive vectors differ in a single coordinate? The problem of existence of such a listing, which is called a cyclic Gray code of H, is known to be NP-complete in general. The goal of this paper is therefore to specify boundaries between its intractability and polynomial decidability. For that purpose, we consider a restriction when the vectors of H are of a bounded weight. A weight of a vector u ∈ {0, 1} is the number of 1’s in u. We show that if every vertex of H has weight k or k + 1, our problem is polynomial for k ≤ 1 and NP-complete for k ≥ 2. Furthermore, if k = 2 and for every i ∈ [n] there are at most m vectors of H of weight two having one in the i-th coordinate, then the problem becomes polynomial for m ≤ 3 and NP-complete for m ≥ 13. The following complementary problem is also known to be NP-hard: given an F ⊆ {0, 1}, which now plays the role of a set of faults to be avoided, is there a cyclic Gray code of {0, 1} \F? We show that if every vertex of F has weight at most k, the problem is polynomial for k ≤ 2 and NP-hard for k ≥ 5. It follows that there is a function f(n) = Θ(n) such that the existence of a cyclic Gray code of {0, 1} \ F for a given set F ⊆ {0, 1} of size at most f(n) is NP-hard. In addition, we study the cases when the Gray code does not have to be cyclic, and moreover, when the first and the last vectors of the code are prescribed. For these two modifications, all NP-hardness and NP-completeness results hold as well.
منابع مشابه
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of ≺ to the set of compositions and bounded compositio...
متن کاملIndependent Even Cycles in the Pancake Graph and Greedy Prefix-Reversal Gray Codes
Any `–cycle, 6 6 `6 n!, can be embedded in the Pancake graph Pn, n > 3. In this paper we prove the existence of a family of maximal sets of even independent cycles with length bounded by O(n2). We introduce the new concept of Prefix– reversal Gray codes based on the independent cycles which extends the known greedy Prefix–reversal Gray code constructions considered by Zaks and Williams. We deri...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملOn the generalized Hamming weights of convolutional codes
Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to de...
متن کاملVisual-Based Emotional Descriptor and Feedback Mechanism for Image Retrieval
A new emotion-based image retrieval method is proposed in this paper. Query emotional descriptors called query color code and query gray code are designed on the basis of human evaluation of 13 emotion pairs (“like-dislike”, “beautiful-ugly”, “naturalunnatural”, “dynamic-static”, “warm-cold”, “gay-sober”, “cheerful-dismal”, “unstablestable”, “light-dark”, “strong-weak”, “gaudy-plain”, “hard-sof...
متن کاملTrace Codes with Few Weights over $\mathbb{F}_p+u\mathbb{F}_p$
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring Fp+uFp. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. Then by using a linear Gray map, we obtain an infinite family of abelian codes with few weights over Fp. In particular, we obtain an infinite family of two-weight codes which me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012